Prêt á Voter with Write-Ins
نویسندگان
چکیده
This paper presents an extension of the Prêt à Voter verifiable voting system to handle write-ins. This is achieved by introducing an additional ‘Write-In’ option and allowing the voter optionally to enter a write-in candidate of their choice. The voter obtains a receipt which includes their write-in, but that receipt does not indicate whether the write-in candidate was selected or not. The system provides flexibility with respect to the tallying of write-in votes. We also introduce null ballots in order to achieve receipt-freeness with respect to write-ins.
منابع مشابه
Simple and Secure Electronic Voting with Prêt á Voter
Prêt à Voter is an electronic voting system with very high security properties. We aim to make the system truly usable and applicable in elections with many races and candidates by allowing the vote to be formed using a voting machine and by printing a minimalistic receipt. We also introduce the procedure/technology mix concept to describe the use of procedures, people and technology to secure ...
متن کاملA New Receipt-Free E-Voting Scheme Based on Blind Signature (Abstract)
Electronic voting has attracted much interest recently and a variety of schemes have been proposed. Generally speaking, all these schemes can be divided into three main approaches: based on blind signature, based on mix networks and based on homomorphic encryption. Schemes based on blind signature are thought to be simple, efficient, and suitable for large scale elections. Fujioka, Okamoto and ...
متن کاملFaster Print on Demand for Prêt à Voter
Printing Prêt à Voter ballots on demand is desirable both for convenience and security. It allows a polling station to serve numerous different ballots, and it avoids many problems associated with the custody of the printouts. This paper describes a new proposal for printing Prêt à Voter ballots on demand. The emphasis is on computational efficiency suitable for real elections, and on very gene...
متن کاملProving Prêt à Voter Receipt Free Using Computational Security Models
Prêt à Voter is a supervised, end-to-end verifiable voting scheme. Informal analyses indicate that, subject to certain assumptions, Prêt à Voter is receipt free, i.e. a voter has no way to construct a proof to a coercer of how she voted. In this paper we propose a variant of Prêt à Voter and prove receipt freeness of this scheme using computational methods. Our proof shows that if there exists ...
متن کاملParallel Shuffling and Its Application to Prêt à Voter
We consider the problem of verifiable parallel shuffling in which the same shuffle is simultaneously performed on two or more lists of input ciphertexts, each list encrypted under a different key. We present three parallelisations of shuffle proofs from different paradigms. The properties of each protocol are analyzed and contrasted, and their suitability for electronic voting discussed. We sho...
متن کامل